Intelligent discrete particle swarm optimization for multiprocessor task scheduling problem
نویسندگان
چکیده
منابع مشابه
Task Scheduling in Distributed Systems using Discrete Particle Swarm Optimization
Finding an optimal schedule of tasks for an application in distributed environment is critical in general. Task assignment is an extremely NP complete problem. This type of problem can be resolved by heuristic algorithms efficiently because the traditional methods such as dynamic programming and the back tracking need more time for solving this NP complete problem. Particle Swarm Optimization (...
متن کاملApplication of Discrete Particle Swarm Optimization for Grid Task Scheduling Problem
Many applications involve the concepts of scheduling, such as communications, packet routing, production planning [Zhai et al., 2006], classroom arrangement [Mathaisel & Comm, 1991], aircrew scheduling [Chang, 2002], nurse scheduling [Ohki et al., 2006], food industrial [Simeonov & Simeonovova, 2002], control system [Fleming & Fonseca, 1993], resource-constrained scheduling problem [Chen, 2007]...
متن کاملAn Efficient Quantum-Behaved Particle Swarm Optimization for Multiprocessor Scheduling
Quantum-behaved particle swarm optimization (QPSO) is employed to deal with multiprocessor scheduling problem (MSP), which speeds the convergence and has few parameters to control. We combine the QPSO search technique with list scheduling to improve the solution quality in short time. At the same time, we produce the solution based on the problem-space heuristic. Several benchmark instances are...
متن کاملMulti-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. Many works have focused on the improvement of the binary-based algorithms. Yet, none of these works have been represented in states. In this paper, by implementing the representation of state in particle swarm optimization (PSO), a variant of PSO ca...
متن کاملImproved Particle Swarm Optimization for Solving Multiprocessor Scheduling Problem: Enhancements and Hybrid Methods
Memetic algorithms (MAs) are hybrid evolutionary algorithms (EAs) that combine global and local search by using an EA to perform exploration while the local search method performs exploitation. Combining global and local search is a strategy used by many successful global optimization approaches, and MAs have in fact been recognized as a powerful algorithmic paradigm for evolutionary computing....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2016
ISSN: 1748-3026,1748-3026
DOI: 10.1177/1748301816665521